Quantile-based clustering

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Clustering of Series Using Quantile Autocovariances

Unlike conventional clustering, fuzzy cluster analysis allows data elements to belong to more than one cluster by assigning membership degrees of each data to clusters. This work proposes a fuzzy C– medoids algorithm to cluster time series based on comparing their estimated quantile autocovariance functions. The behaviour of the proposed algorithm is studied on different simulated scenarios and...

متن کامل

Copula-Based Quantile Autoregression

Parametric copulae are shown to be an attractive device for specifying quantile autoregressive models for nonlinear time-series. Estimation of local, quantile-specific models offers some salient advantages over classical global parametric approaches. Consistency and asymptotic normality of the proposed estimators are established, leading to a general framework for inference and model specificat...

متن کامل

Quantile-based categorical statistics

Traditional point-to-point verification is more and more superseded by situation-based verification such as an object-oriented mode. One main reason is that difficulties are encountered while interpreting the outcome of a conventional contingency table based on amplitude thresholds. Firstly, a predetermined amplitude threshold splits the distributions under comparison at an unknown location. In...

متن کامل

A quantile-quantile plot based pattern matching for defect detection

Pattern matching has been used extensively for many machine vision applications such as optical character recognition, face detection, object detection, and defect detection. The normalized cross correlation (NCC) is the most commonly used technique in pattern matching. However, it is computationally intensive, sensitive to environmental changes such as lighting and shifting, and suffers from f...

متن کامل

Entropy-based Consensus for Distributed Data Clustering

The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Statistics

سال: 2019

ISSN: 1935-7524

DOI: 10.1214/19-ejs1640